Tangent Hyperplanes to Subriemannian Balls

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tangent Hyperplanes to Subriemannian Balls

We examine the existence of tangent hyperplanes to subriemannian balls. Strictly abnormal shortest paths are allowed.

متن کامل

Using Tangent Hyperplanes to Direct Neural Training

The trend in the development and adoption of neural training regimes for supervised learning in feedforward neural networks has been to follow gradient approaches already successful in numerical analysis. However, weak direction can be seen to be common to the neural implementation of such approaches which in large measure is due to vector summation. We provide a training method, Tangent Hyperp...

متن کامل

Enumeration of N-fold Tangent Hyperplanes to a Surface

For each 1 ≤ n ≤ 6 we present formulas for the number of n−nodal curves in an n−dimensional linear system on a smooth, projective surface. This yields in particular the numbers of rational curves in the system of hyperplane sections of a generic K3−surface imbedded in IP n by a complete system of curves of genus n as well as the number 17,601,000 of rational (singular) plane quintic curves in a...

متن کامل

Lines Tangent to Four Unit Balls problem 2

The Golden Partition Conjecture is motivated by conjectures whose root is a famous sorting problem. Imagine that a finite set S with cardinality n has a hidden total order ≺ that we would like to uncover by making comparisons between pairs of elements from S. Comparing a pair u, v ∈ S means uncovering either u ≺ v or v ≺ u. How many comparisons are needed in the worst case? The classical answer...

متن کامل

Indexing Metric Spaces with Nested Forests of Topological Balls and Hyperplanes

Searching in a dataset for objects that are similar, with respect to a distance, to a given query object is a fundamental problem for several applications that use complex data, e.g., strings, graphs. The main difficulties are to focus the search on as few elements as possible and to further limit the computationally-extensive distance calculations between them. Here, we introduce a forest data...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamical and Control Systems

سال: 2015

ISSN: 1079-2724,1573-8698

DOI: 10.1007/s10883-015-9296-1